Radially Moore graphs of radius three and large odd degree
نویسندگان
چکیده
Extremal graphs which are close related to Moore graphs have been defined in different ways. Radially Moore graphs are one of these examples of extremal graphs. Although it is proved that radially Moore graphs exist for radius two, the general problem remains open. Knor, and independently Exoo, gives some constructions of these extremal graphs for radius three and small degrees. As far as we know, some few examples have been found for other small values of the degree and the radius. Here, we consider the existence problem of radially Moore graphs of radius three. We use the generalized undirected de Bruijn graphs to give a general construction of radially Moore graphs of radius three and large odd degree.
منابع مشابه
On the construction of radially Moore digraphs
A digraph with maximum out-degree d and radius k has at most 1+d+ · · ·+d vertices, as the Moore bound states. Regular digraphs attaining such a bound and whose diameter is at most k + 1 are called radially Moore digraphs. Knor [4] proved that these extremal digraphs do exist for any value of d ≥ 1 and k ≥ 1. In this paper, we introduce a digraph operator, based on the line digraph, which allow...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملSolution to a Conjecture on the Maximum Skew-Spectral Radius of Odd-Cycle Graphs
Let G be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Linear Algebra Appl. 436(12):4512-1829, 2012] showed that the spectral radius of G is the same for every orientation σ of G, and equals the maximum matching root of G. They proposed a conjecture that the graphs which attain the maximum skew spectral radius among the odd-cycle graphs G of order n are isomorphic...
متن کاملOn radially maximal graphs
A graph is radially maximal if its radius decreases after the addition of any edge of its complement. It is proved that any graph can be an induced subgraph of a regular radially maximal graph with a prescribed radius T 2: 3. For T 2: 4, k 2: 1, radially maximal graphs with radius T containing k cut-nodes are constructed.
متن کاملSkolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011